Nuprl Lemma : closure-well-founded-total 11,40

T:Type, R:(TT).
WellFnd{i}(T;x,y.R(x,y))
 (xy:T. Dec(R(x,y)))
 (y:TL:T List. (x:T. (R(x,y))  (x  L)))
 one-one(T;T;R)
 (yz:T. (x:T. ((R(x,y))) & ((R(x,z))))  (y = z))
 (ab:T. ((R^*)(a,b))  ((R^*)(b,a))) 
latex


DefinitionsR^*, f(a), left + right, P  Q, x:AB(x), P & Q, t  T, A, x:AB(x), , x:A  B(x), False, A c B, Type, {T}, WellFnd{i}(A;x,y.R(x;y)), Dec(P), a < b, (x  l), one-one(A;B;R), P  Q, Void, x.A(x), xt(x), x:AB(x), x,yt(x;y), type List, s = t, rel_exp(T;R;n), x f y, {x:AB(x)} , , #$n, -n, n+m, , n - m, A  B, s ~ t, P  Q, SQType(T)
Lemmasrel exp-one-one, rel-exp-add-iff, decidable le, nat wf, rel exp wf, le wf, one-one wf, l member wf, decidable wf, wellfounded wf, wellfounded-minimal-field, rel star wf, not wf

origin